/*
 * Copyright 2012 Fabian Wenzelmann
 * 
 * This file is part of Recognition-Procedures-for-Boolean-Functions.
 * 
 * Recognition-Procedures-for-Boolean-Functions is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * Recognition-Procedures-for-Boolean-Functions is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with Recognition-Procedures-for-Boolean-Functions.  If not, see <http://www.gnu.org/licenses/>.
 */

package de.wenzelmf.booleanFunction.parser;

import java.io.StringReader;

public class BooleanExpressionParserTest {
	
	public static void main(String[] args)
	{
		String[] strings = {"A -> B && ~C || D", "A && B && C || D && E && F || G -> H || I <-> J", "B || C",
				"A && (B || C)", "A && false || true", "A && B && C && D && E"};
		
		BFParser p = new BFParser(new StringReader(""));
		
		for(String s : strings)
		{
			StringReader r = new StringReader(s);
			p.ReInit(r);
		
			try {
				System.out.println("Converted \"" + s + "\" to \"" + p.Expression() + "\"");
			} catch (ParseException e) {
				e.printStackTrace();
			}	
		}
	}
	
}
